Connected modal logics
نویسندگان
چکیده
We introduce the concept of a connected logic (over S4) and show that each connected logic with the finite model property is the logic of a subalgebra of the closure algebra of all subsets of the real line R, thus generalizing theMcKinsey-Tarski theorem.As a consequence,weobtain that each intermediate logicwith thefinitemodel property is the logic of a subalgebra of the Heyting algebra of all open subsets of R.
منابع مشابه
Maksimova ON VARIABLE SEPARATION IN MODAL LOGICS
It was proved in [4] that interpolation properties of propositional normal modal logics (n.m.l.) are closely connected with amalgamation properties of associated varieties of modal algebras. In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden-completeness in any n.m.l. is equivalent to the so-called Super-Embedding Property of...
متن کاملA Syntactic Realization Theorem for Justification Logics
Justification logics are refinements of modal logics where modalities are replaced by justification terms. They are connected to modal logics via so-called realization theorems. We present a syntactic proof of a single realization theorem that uniformly connects all the normal modal logics formed from the axioms d, t, b, 4, and 5 with their justification counterparts. The proof employs cut-free...
متن کاملOn the Ternary Relation and Conditionality
Here is a familiar history: modal logics (see [13]) were around for some time before a semantic framework was found for them (by Kripke and others).1 This framework did at least two Very Good Things for modal logics: 1) it connected the powerful mathematical tools of model theory to these logics, allowing a variety of technical results to be proven, and 2) it connected modal logics (more) firml...
متن کاملRealization for justification logics via nested sequents: Modularity through embedding
Justification logics are refinements of modal logics, where justification terms replace modalities. Modal and justification logics are connected via the so-called realization theorems. We develop a general constructive method of proving the realization of a modal logic in an appropriate justification logic by means of cut-free modal nested sequent systems. We prove a constructive realization th...
متن کاملA study on multi-dimensional products of graphs and hybrid logics
In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable ...
متن کاملRealization Theorems for Justification Logics: Full Modularity
Justification logics were introduced by Artemov in 1995 to provide intuitionistic logic with a classical provability semantics, a problem originally posed by Gödel. Justification logics are refinements of modal logics and formally connected to them by so-called realization theorems. A constructive proof of a realization theorem typically relies on a cut-free sequent-style proof system for the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 50 شماره
صفحات -
تاریخ انتشار 2011